Optimization of Multistate Energies by Tree Search): A provable and efficient protein design algorithm to optimize binding affinity and specificity with respect to sequence

نویسندگان

  • Mark A. Hallen
  • Bruce R. Donald
چکیده

(Constrained Optimization of Multi-state Energies by Tree Search): A provable and efficient protein design algorithm to optimize binding affinity and specificity with respect to sequence. Section A provides a highly simplified, " toy " example of a multistate protein design calculation to demonstrate the operation of comets. Section B provides details of the methods used to compute lower bounds for LMEs over sequence spaces. Section C provides details on the protein design runs described in Section 3 of the main text. Let us introduce a highly simplified, " toy " example to explain the algorithm. Say we are designing a peptide inhibitor for a protein, " targetin, " involved in some disease. We want our peptide to not bind a related protein, " offtargetin, " because this binding would cause toxicity. However, we do have a peptide (say, a natural product) that binds both targetin and offtargetin, and we have crystal structures of this peptide with both targetin (structure T) and offtargetin (structure O). Thus, we set up a multistate design as follows. There will be four states: peptide bound to targetin (structure T), unbound peptide in targetin-binding conformation (peptide from structure T), peptide bound to offtargetin (structure O), and unbound peptide in offtargetin-binding conformation (peptide from structure O). These states will be called T-bound, T-unbound, O-bound, and O-unbound respectively. We will optimize the binding energy for the peptide-targetin interaction, which is the difference between the T-bound and T-unbound state energies. We will constrain binding energy for the peptide-offtargetin interaction to be worse than a threshold E u : say, 10 kcal/mol worse than the wild-type binding energy. We will also constrain the unbound state to be stable, by demanding that the average of the T-unbound and O-unbound state energies be at most 10 kcal/mol worse than wild type. All of these constraints, and the objective function, are simple LMEs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

comets (Constrained Optimization of Multistate Energies by Tree Search): A Provable and Efficient Protein Design Algorithm to Optimize Binding Affinity and Specificity with Respect to Sequence

Practical protein design problems require designing sequences with a combination of affinity, stability, and specificity requirements. Multistate protein design algorithms model multiple structural or binding "states" of a protein to address these requirements. comets provides a new level of versatile, efficient, and provable multistate design. It provably returns the minimum with respect to se...

متن کامل

Comets (Constrained Optimization of Multistate Energies by Tree Search): A Provable and Efficient Algorithm to Optimize Binding Affinity and Specificity with Respect to Sequence

Practical protein design problems require designing sequences with a combination of affinity, stability, and specificity requirements.Multistate protein design algorithms model multiple structural or binding “states” of a protein to address these requirements. comets provides a new level of versatile, efficient, and provable multistate design. It provably returns the minimum with respect to seq...

متن کامل

DESIGN OPTIMIZATION OF CABLE-STAYED BRIDGES USING MOMENTUM SEARCH ALGORITHM

Design optimization of cable-stayed bridges is a challenging optimization problem because a large number of variables is usually involved in the optimization process. For these structures the design variables are cross-sectional areas of the cables. In this study, an efficient metaheuristic algorithm namely, momentum search algorithm (MSA) is used to optimize the design of cable-stayed bridges....

متن کامل

BBK* (Branch and Bound over K*): A Provable and Efficient Ensemble-Based Algorithm to Optimize Stability and Binding Affinity over Large Sequence Spaces

Protein design algorithms that compute binding affinity search for sequences with an energetically favorable free energy of binding. Recent work shows that the following design principles improve the biological accuracy of protein design: ensemble-based design and continuous conformational flexibility. Ensemble-based algorithms capture a measure of entropic contributions to binding affinity, Ka...

متن کامل

AN EFFICIENT HYBRID ALGORITHM BASED ON PARTICLE SWARM AND SIMULATED ANNEALING FOR OPTIMAL DESIGN OF SPACE TRUSSES

In this paper, an efficient optimization algorithm is proposed based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) to optimize truss structures. The proposed algorithm utilizes the PSO for finding high fitness regions in the search space and the SA is used to perform further investigation in these regions. This strategy helps to use of information obtained by swarm in an opt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015